Finite Sequences and Tuples of Elements of a Non-empty Sets
نویسنده
چکیده
The first part of the article is a continuation of [4]. Next, we define the identity sequence of natural numbers and the constant sequences. The main part of this article is the definition of tuples. The element of a set of all sequences of the length n of D is called a tuple of a non-empty set D and it is denoted by element of Dn. Also some basic facts about tuples of a non-empty set are proved.
منابع مشابه
Non-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملPairwise non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups
Let $G$ be a finite group. A subset $X$ of $G$ is a set of pairwise non-commuting elements if any two distinct elements of $X$ do not commute. In this paper we determine the maximum size of these subsets in any finite non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup.
متن کاملCages - the External Approximation of Jordan’s Curve
On the Euclidean plane Jordan's curve may be approximated with a polygonal path of sides parallel to coordinate axes, either externally, or internally. The paper deals with the external approximation, and the existence of a Cage – an external polygonal path – is proved. We adopt the following rules: k, n are natural numbers, D is a non empty set, and f , g are finite sequences of elements of D....
متن کاملCut, Paste and Filter
We study the combined and separate effects of three parts of finite multi-testtube cut and paste DNA computing. First, we reformulate the ideas of Csuhaj-Varjú, Kari, and Pǎun [1], Freund [3], and Priese, Rogojine and Margenstern [10] about multi-test-tube splicing DNA computing in terms of cutting and pasting as in Pixton’s work. Pixton shows [8, 9] that with finite cutting and pasting only re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990